Irredundance, secure domination and maximum degree in trees
نویسنده
چکیده
It is shown that the lower irredundance number and secure domination number of an n vertex tree T with maximum degree 3, are bounded below by 2(n+ 1)/(2 + 3) (T = K1, ) and ( n+ − 1)/(3 − 1), respectively. The bounds are sharp and extremal trees are exhibited. © 2006 Elsevier B.V. All rights reserved. MSC: 05C69
منابع مشابه
On the differences of the independence, domination and irredundance parameters of a graph
In this paper we present upper bounds on the differences between the independence, domination and irredundance parameters of a graph. For example, using the Brooks theorem on the chromatic number, we show that for any graph G of order n with maximum degree ∆ ≥ 2 IR(G)− β(G) ≤ ⌊ ∆− 2 2∆ n ⌋ , where β(G) and IR(G) are the independence number and the upper irredundance number of a graph G, respect...
متن کاملIndependence Saturation and Extended Domination Chain in Graphs
The six basic parameters relating to domination, independence and irredundance satisfy a chain of inequalities given by ir ≤ γ ≤ i ≤ β0 ≤ Γ ≤ IR where ir, IR are the irredundance and upper irredundance numbers, γ,Γ are the domination and upper domination numbers and i, β0 are the independent domination number and independence number respectively. In this paper, we introduce the concept of indep...
متن کاملClasses of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance
This paper investigates cases where one graph parameter, upper fractional domination, is equal to three others: independence, upper domination and upper irredundance. We show that they are all equal for a large subclass, known as strongly perfect graphs, of the class of perfect graphs. They are also equal for odd cycles and upper bound graphs. However for simplicial graphs, upper irredundance m...
متن کاملGallai-type theorems and domination parameters
Let 7(G) denote the minimum cardinality of a dominating set of a graph G = (V,E). A longstanding upper bound for 7(G) is attributed to Berge: For any graph G with n vertices and maximum degree A(G), 7(G) <~ n A(G). We eharacterise connected bipartite graphs which achieve this upper bound. For an arbitrary graph G we furnish two conditions which are necessary if 7(G) + A(G) = n and are sufficien...
متن کاملA lower bound for the irredundance number of trees
Let ir(G) and γ(G) be the irredundance number and domination number of a graph G, respectively. The number of vertices and leafs of a graph G is denoted by n(G) and n1(G). If T is a tree, then Lemańska [4] presented in 2004 the sharp lower bound γ(T ) ≥ n(T ) + 2− n1(T ) 3 . In this paper we prove ir(T ) ≥ n(T ) + 2− n1(T ) 3 for an arbitrary tree T . Since γ(T ) ≥ ir(T ) is always valid, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007